0.00/0.10 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.09/0.12 % Command : eprover-ho %s --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --free-numbers -auto-schedule -p --cpu-limit=%d --neg-ext=all --pos-ext=all --ext-sup-max-depth=2 --schedule-kind=CASC 0.12/0.32 % Computer : n012.cluster.edu 0.12/0.32 % Model : x86_64 x86_64 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.12/0.32 % Memory : 8042.1875MB 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64 0.12/0.32 % CPULimit : 1200 0.12/0.32 % WCLimit : 120 0.12/0.32 % DateTime : Tue Jul 13 15:20:01 EDT 2021 0.12/0.33 % CPUTime : 0.12/0.33 % Number of cores: 8 0.18/0.33 % Python version: Python 3.6.8 0.18/0.33 # Version: 2.6rc1-ho 0.18/0.34 # No SInE strategy applied 0.18/0.34 # Trying AutoSched0 for 59 seconds 0.58/0.76 # AutoSched0-Mode selected heuristic G_E___303_C18_F1_URBAN_S0Y 0.58/0.76 # and selection function SelectMaxLComplexAvoidPosPred. 0.58/0.76 # 0.58/0.76 # Preprocessing time : 0.086 s 0.58/0.76 0.58/0.76 # Proof found! 0.58/0.76 # SZS status Theorem 0.58/0.76 # SZS output start CNFRefutation 0.58/0.76 thf(def_d_not, axiom, (d_not)=(^[X36:$o]:(X36=>~$true)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_d_not)). 0.58/0.76 thf(def_imp, axiom, (imp)=(^[X34:$o, X35:$o]:(X34=>X35)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_imp)). 0.58/0.76 thf(def_all_of, axiom, (all_of)=(^[X3:$i > $o, X2:$i > $o]:![X4:$i]:(X3 @ X4=>X2 @ X4)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_all_of)). 0.58/0.76 thf(def_is_of, axiom, (is_of)=(^[X1:$i, X2:$i > $o]:X2 @ X1), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_is_of)). 0.58/0.76 thf(def_non, axiom, (non)=(^[X1:$i, X2:$i > $o, X4:$i]:(X2 @ X4=>~$true)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_non)). 0.58/0.76 thf(def_l_some, axiom, (l_some)=(^[X1:$i, X2:$i > $o]:(![X472:$i]:(in @ X472 @ X1=>(X2 @ X472=>~$true))=>~$true)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_l_some)). 0.58/0.76 thf(def_n_is, axiom, (n_is)=(^[X548:$i, X549:$i]:(X548)=(X549)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_n_is)). 0.58/0.76 thf(def_e_is, axiom, (e_is)=(^[X1:$i, X60:$i, X61:$i]:(X60)=(X61)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_e_is)). 0.58/0.76 thf(def_n_some, axiom, (n_some)=(^[X550:$i > $o]:(![X551:$i]:(in @ X551 @ nat=>(X550 @ X551=>~$true))=>~$true)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_n_some)). 0.58/0.76 thf(def_diffprop, axiom, (diffprop)=(^[X1:$i, X183:$i, X4:$i]:(X1)=(n_pl @ X183 @ X4)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', def_diffprop)). 0.58/0.76 thf(def_l_or, axiom, (l_or)=(^[X42:$o, X467:$o]:((X42=>~$true)=>X467)), file('/export/starexec/sandbox2/benchmark/Axioms/NUM007^0.ax', def_l_or)). 0.58/0.76 thf(def_iii, axiom, (iii)=(^[X1:$i, X185:$i]:(![X575:$i]:(in @ X575 @ nat=>((X185)=(n_pl @ X1 @ X575)=>~$true))=>~$true)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', def_iii)). 0.58/0.76 thf(def_d_29_ii, axiom, (d_29_ii)=(^[X1:$i, X184:$i]:(![X572:$i]:(in @ X572 @ nat=>((X1)=(n_pl @ X184 @ X572)=>~$true))=>~$true)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', def_d_29_ii)). 0.58/0.76 thf(def_lessis, axiom, (lessis)=(^[X1:$i, X188:$i]:(((![X580:$i]:(in @ X580 @ nat=>((X188)=(n_pl @ X1 @ X580)=>~$true))=>~$true)=>~$true)=>(X1)=(X188))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', def_lessis)). 0.58/0.76 thf(def_moreis, axiom, (moreis)=(^[X1:$i, X187:$i]:(((![X579:$i]:(in @ X579 @ nat=>((X1)=(n_pl @ X187 @ X579)=>~$true))=>~$true)=>~$true)=>(X1)=(X187))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', def_moreis)). 0.58/0.76 thf(satz24a, conjecture, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (lessis @ n_1), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', satz24a)). 0.58/0.76 thf(satz24, axiom, all_of @ (^[X1:$i]:in @ X1 @ nat) @ (^[X1:$i]:moreis @ X1 @ n_1), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', satz24)). 0.58/0.76 thf(c_0_17, axiom, (d_not)=(^[X36:$o]:(X36=>~$true)), inference(apply_def,[status(thm)],[def_d_not, def_imp])). 0.58/0.76 thf(c_0_18, axiom, (all_of)=(^[X3:$i > $o, X2:$i > $o]:![X4:$i]:(X3 @ X4=>X2 @ X4)), inference(apply_def,[status(thm)],[def_all_of, def_is_of])). 0.58/0.76 thf(c_0_19, axiom, (non)=(^[X1:$i, X2:$i > $o, X4:$i]:(X2 @ X4=>~$true)), inference(apply_def,[status(thm)],[def_non, c_0_17])). 0.58/0.76 thf(c_0_20, axiom, (l_some)=(^[X1:$i, X2:$i > $o]:(![X472:$i]:(in @ X472 @ X1=>(X2 @ X472=>~$true))=>~$true)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_l_some, c_0_18]), c_0_17]), c_0_19])). 0.58/0.76 thf(c_0_21, axiom, (n_is)=(^[X548:$i, X549:$i]:(X548)=(X549)), inference(apply_def,[status(thm)],[def_n_is, def_e_is])). 0.58/0.76 thf(c_0_22, axiom, (n_some)=(^[X550:$i > $o]:(![X551:$i]:(in @ X551 @ nat=>(X550 @ X551=>~$true))=>~$true)), inference(apply_def,[status(thm)],[def_n_some, c_0_20])). 0.58/0.76 thf(c_0_23, axiom, (diffprop)=(^[X1:$i, X183:$i, X4:$i]:(X1)=(n_pl @ X183 @ X4)), inference(apply_def,[status(thm)],[def_diffprop, c_0_21])). 0.58/0.76 thf(c_0_24, axiom, (l_or)=(^[X42:$o, X467:$o]:((X42=>~$true)=>X467)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_l_or, def_imp]), c_0_17])). 0.58/0.76 thf(c_0_25, axiom, (iii)=(^[X1:$i, X185:$i]:(![X575:$i]:(in @ X575 @ nat=>((X185)=(n_pl @ X1 @ X575)=>~$true))=>~$true)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_iii, c_0_22]), c_0_23])). 0.58/0.76 thf(c_0_26, axiom, (d_29_ii)=(^[X1:$i, X184:$i]:(![X572:$i]:(in @ X572 @ nat=>((X1)=(n_pl @ X184 @ X572)=>~$true))=>~$true)), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_d_29_ii, c_0_22]), c_0_23])). 0.58/0.76 thf(c_0_27, axiom, (lessis)=(^[X1:$i, X188:$i]:(((![X580:$i]:(in @ X580 @ nat=>((X188)=(n_pl @ X1 @ X580)=>~$true))=>~$true)=>~$true)=>(X1)=(X188))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_lessis, c_0_24]), c_0_21]), c_0_25])). 0.58/0.76 thf(c_0_28, axiom, (moreis)=(^[X1:$i, X187:$i]:(((![X579:$i]:(in @ X579 @ nat=>((X1)=(n_pl @ X187 @ X579)=>~$true))=>~$true)=>~$true)=>(X1)=(X187))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[def_moreis, c_0_24]), c_0_21]), c_0_26])). 0.58/0.76 thf(c_0_29, negated_conjecture, ~(![X2011:$i]:(in @ X2011 @ nat=>(![X2015:$i]:(in @ X2015 @ nat=>(X2011)!=(n_pl @ n_1 @ X2015))=>(n_1)=(X2011)))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[satz24a]), c_0_18]), c_0_27])])). 0.58/0.76 thf(c_0_30, plain, ![X2412:$i]:(in @ X2412 @ nat=>(![X2416:$i]:(in @ X2416 @ nat=>(X2412)!=(n_pl @ n_1 @ X2416))=>(X2412)=(n_1))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[satz24, c_0_18]), c_0_28])])). 0.58/0.76 thf(c_0_31, negated_conjecture, ![X3105:$i]:(in @ esk79_0 @ nat&((~in @ X3105 @ nat|(esk79_0)!=(n_pl @ n_1 @ X3105))&(n_1)!=(esk79_0))), inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])])])). 0.58/0.76 thf(c_0_32, plain, ![X3169:$i]:((in @ (esk93_1 @ X3169) @ nat|(X3169)=(n_1)|~in @ X3169 @ nat)&((X3169)=(n_pl @ n_1 @ (esk93_1 @ X3169))|(X3169)=(n_1)|~in @ X3169 @ nat)), inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_30])])])])). 0.58/0.76 thf(c_0_33, negated_conjecture, ![X1:$i]:(~in @ X1 @ nat|(esk79_0)!=(n_pl @ n_1 @ X1)), inference(split_conjunct,[status(thm)],[c_0_31])). 0.58/0.76 thf(c_0_34, plain, ![X1:$i]:((X1)=(n_pl @ n_1 @ (esk93_1 @ X1))|(X1)=(n_1)|~in @ X1 @ nat), inference(split_conjunct,[status(thm)],[c_0_32])). 0.58/0.76 thf(c_0_35, plain, ![X1:$i]:(in @ (esk93_1 @ X1) @ nat|(X1)=(n_1)|~in @ X1 @ nat), inference(split_conjunct,[status(thm)],[c_0_32])). 0.58/0.76 thf(c_0_36, negated_conjecture, ![X1:$i]:((X1)=(n_1)|(X1)!=(esk79_0)|~in @ X1 @ nat), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_33, c_0_34]), c_0_35])). 0.58/0.76 thf(c_0_37, negated_conjecture, in @ esk79_0 @ nat, inference(split_conjunct,[status(thm)],[c_0_31])). 0.58/0.76 thf(c_0_38, negated_conjecture, (n_1)!=(esk79_0), inference(split_conjunct,[status(thm)],[c_0_31])). 0.58/0.76 thf(c_0_39, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_36, c_0_37]), c_0_38]), ['proof']). 0.58/0.76 # SZS output end CNFRefutation 0.58/0.76 # Proof object total steps : 40 0.58/0.76 # Proof object clause steps : 7 0.58/0.76 # Proof object formula steps : 33 0.58/0.76 # Proof object conjectures : 8 0.58/0.76 # Proof object clause conjectures : 5 0.58/0.76 # Proof object formula conjectures : 3 0.58/0.76 # Proof object initial clauses used : 5 0.58/0.76 # Proof object initial formulas used : 17 0.58/0.76 # Proof object generating inferences : 2 0.58/0.76 # Proof object simplifying inferences : 2 0.58/0.76 # Training examples: 0 positive, 0 negative 0.58/0.76 # Parsed axioms : 398 0.58/0.76 # Removed by relevancy pruning/SinE : 0 0.58/0.76 # Initial clauses : 624 0.58/0.76 # Removed in clause preprocessing : 169 0.58/0.76 # Initial clauses in saturation : 455 0.58/0.76 # Processed clauses : 936 0.58/0.76 # ...of these trivial : 10 0.58/0.76 # ...subsumed : 259 0.58/0.76 # ...remaining for further processing : 667 0.58/0.76 # Other redundant clauses eliminated : 1610 0.58/0.76 # Clauses deleted for lack of memory : 0 0.58/0.76 # Backward-subsumed : 6 0.58/0.76 # Backward-rewritten : 10 0.58/0.76 # Generated clauses : 12262 0.58/0.76 # ...of the previous two non-trivial : 10390 0.58/0.76 # Contextual simplify-reflections : 13 0.58/0.76 # Paramodulations : 10306 0.58/0.76 # Factorizations : 0 0.58/0.76 # NegExts : 8 0.58/0.76 # Equation resolutions : 1692 0.58/0.76 # Propositional unsat checks : 0 0.58/0.76 # Propositional check models : 0 0.58/0.76 # Propositional check unsatisfiable : 0 0.58/0.76 # Propositional clauses : 0 0.58/0.76 # Propositional clauses after purity: 0 0.58/0.76 # Propositional unsat core size : 0 0.58/0.76 # Propositional preprocessing time : 0.000 0.58/0.76 # Propositional encoding time : 0.000 0.58/0.76 # Propositional solver time : 0.000 0.58/0.76 # Success case prop preproc time : 0.000 0.58/0.76 # Success case prop encoding time : 0.000 0.58/0.76 # Success case prop solver time : 0.000 0.58/0.76 # Current number of processed clauses : 592 0.58/0.76 # Positive orientable unit clauses : 97 0.58/0.76 # Positive unorientable unit clauses: 3 0.58/0.76 # Negative unit clauses : 57 0.58/0.76 # Non-unit-clauses : 435 0.58/0.76 # Current number of unprocessed clauses: 9874 0.58/0.76 # ...number of literals in the above : 57059 0.58/0.76 # Current number of archived formulas : 0 0.58/0.76 # Current number of archived clauses : 20 0.58/0.76 # Clause-clause subsumption calls (NU) : 78477 0.58/0.76 # Rec. Clause-clause subsumption calls : 11765 0.58/0.76 # Non-unit clause-clause subsumptions : 176 0.58/0.76 # Unit Clause-clause subsumption calls : 11516 0.58/0.76 # Rewrite failures with RHS unbound : 2 0.58/0.76 # BW rewrite match attempts : 51 0.58/0.76 # BW rewrite match successes : 9 0.58/0.76 # Condensation attempts : 0 0.58/0.76 # Condensation successes : 0 0.58/0.76 # Termbank termtop insertions : 311541 0.58/0.77 0.58/0.77 # ------------------------------------------------- 0.58/0.77 # User time : 0.418 s 0.58/0.77 # System time : 0.019 s 0.58/0.77 # Total time : 0.437 s 0.58/0.77 # Maximum resident set size: 2316 pages 0.58/0.77 EOF